Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
نویسندگان
چکیده
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block pentadiagonal H-matrices is also described. In addition, the availability of these preconditioners is illustrated with some numerical experiments arising from two dimensional biharmonic equation. Keywords—Parallel algorithm, Pentadiagonal matrix, Polynomial approximate inverse, Preconditioners, Stair matrix.
منابع مشابه
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...
متن کاملRotated Alternative LU Decomposition Method and Its Preconditioner for Periodic Block Pentadiagonal Linear Systems on Vector Processor
In this paper, a new method "Rotated Alternative LU (Rotated ALU) decomposition" for solving block pentadiagonal linear systems is proposed, that makes vector processing more e cient. And a new way to apply the Rotated ALU decomposition to periodic pentadiagonal linear systems is proposed. A few numerical experiments show that these methods are more faster than the conventional LU decomposition.
متن کاملParallel Multilevel Block ILU Preconditioning Techniques for Large Sparse Linear Systems
We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU) factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We c...
متن کاملParallel two level block ILU preconditioning techniques for solving large sparse linear systems
We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We introduce a class of parallel preconditioning techniques for general sparse linear systems based on a two level block ILU factorization strategy. We give some new data structures and strategies to construct loca...
متن کامل